Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under Time-of-use tariff

This study investigates the minimization of total electricity cost in a two-machine permutation flow shop scheduling problem under most common tariff, Time-of-Use (ToU). We provide new property and solution approach to enhance existing methods literature. First, we an overview optimal cases for some specific ToU pricing structures that consist only two intervals. When price decreases, Johnson’s rule dynamic programming give rise solution. On other hand, when increases, condition optimality rule. Second, develop based on determine sequence general structures. Third, propose mixed-integer linear programming. Then, design exact method “Logic-based Benders decomposition” solve problem. Finally, numerical tests show our proposed significantly improves quality results